Four Symmetry Classes of Plane Partitions under One Roof

نویسنده

  • Greg Kuperberg
چکیده

In previous paper, the author applied the permanent-determinant method of Kasteleyn and its non-bipartite generalization, the Hafnian-Pfaffian method, to obtain a determinant or a Pfaffian that enumerates each of the ten symmetry classes of plane partitions. After a cosmetic generalization of the Kasteleyn method, we identify the matrices in the four determinantal cases (plain plane partitions, cyclically symmetric plane partitions, transposecomplement plane partitions, and the intersection of the last two types) in the representation theory of sl(2,C). The result is a unified proof of the four enumerations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

m at h . C O ] 4 A ug 1 99 8 PLANE PARTITIONS II : 5 1 2 SYMMETRY CLASSES

We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous proofs of these four cases were quite complicated. For one more symmetry class we give an elementary proof in the case when two of the sides of the box are eq...

متن کامل

Plane Partitions Ii: 5 1 2 Symmetry Classes

We present new, simple proofs for the enumeration of ve of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous proofs of these four cases were quite complicated. For one more symmetry class we give an elementary proof in the case when two of the sides of the box are equa...

متن کامل

Some Hidden Relations Involving the Ten Symmetry Classes of Plane Partitions

Let B be a partially ordered product of three finite chains. For any group G of automorphisms of B, let N,(B, q) denote the rank generating function for G-invariant order ideals of B. If we regard B as a rectangular prism, N,(B, q) can be viewed as a generating function for plane partitions that fit inside B. Similarly, define Nh(B, 4) to be the rank generating function for order ideals of the ...

متن کامل

Symmetries of Plane Partitions and the Permanent - Determinant Method

In the paper [13], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with the two papers [1] and [14] completes the project of proving all ten formulas. We enumerate cyclically symmetric, self-complementary plane partitions. We first convert plane partitions to tilings of a hexagon in the plane by rhombuses, or equivalently to matchin...

متن کامل

An Exploration of the Permanent-Determinant Method

The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kasteleyn. We present several new techniques and arguments related to the permanent-determinant with consequences in enumerative combinatorics. Here are some of the results that follow from these techniques: 1. If a biparti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 75  شماره 

صفحات  -

تاریخ انتشار 1996